Node Rewriting in Hypergraphs
نویسندگان
چکیده
Pullback rewriting has recently been introduced as a new and unifying paradigm for vertex rewriting in graphs. In this paper we show how to extend it to describe in a uniform way more rewriting mechanisms such as node and handle rewriting in hypergraphs.
منابع مشابه
Node rewriting in graphs and hypergraphs: a categorical framework
Vertex rewriting in graphs is a very powerful mechanism which has been studied for quite a long time. In this paper we eventually provide a categorical theory of vertex rewriting and show how it can extend in a uniform way to node and pattern rewriting mechanisms in hypergraphs. 1 Introduction After more than twenty ve years of (hyper)graph rewriting 16], a large number of rewriting mechanisms ...
متن کاملRewriting in Free Hypegraph Categories
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures recently appeared in cross-disciplinary applications, including the study of quantum processes, dynamical systems and natural language processing...
متن کاملNet Refinement by Pullback Rewriting
The notion of pullback rewriting has been developed recently as a category theoretical framework for vertex replacement in graphs. Here, the technique is presented based on net morphisms, yielding a well-deened mechanism which is closely related to pullback rewriting in hypergraphs. Finally, a net reenement operation modifying the context of the reened transition is characterized in terms of pu...
متن کاملHypergraph rewriting using conformisms
In this paper we study single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, 2,4]. As an application, single-pushout transformation in a category of hypergraphs with a special type of partial morphisms, the conformisms, is presented. In particular , we show the existence of the pushout of any pair of conformisms of hypergraphs...
متن کاملSoftware Evolution via Hierarchical Hypergraphs with Flexible Coverage
We present a simple, abstract approach to the use of hierarchical hypergraphs in software evolution. Borrowing ideas from graph transformation and attribute grammars, we show how these hypergraphs can be used in a flexible way to cover all or part of a software development process. This unifying framework allows to design a set of tools based on common data structures and representations and ap...
متن کامل